Isoperimetric Constants of (d,f )-Regular Planar Graphs

نویسندگان

  • Yusuke HIGUCHI
  • Tomoyuki SHIRAI
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Isoperimetric Numbers of Regular Graphs of High Degree with Applications to Arithmetic Riemann Surfaces

We derive upper and lower bounds on the isoperimetric numbers and bisection widths of a large class of regular graphs of high degree. Our methods are combinatorial and do not require a knowledge of the eigenvalue spectrum. We apply these bounds to random regular graphs of high degree and the Platonic graphs over the rings Zn. In the latter case we show that these graphs are generally nonRamanuj...

متن کامل

Explicit isoperimetric constants, phase transitions in the random-cluster and Potts models, and Bernoullicity

The random-cluster model is a dependent percolation model that has applications in the study of Ising and Potts models. In this paper, several new results for the random-cluster model with cluster parameter q ≥ 1 are obtained. These include an explicit pointwise dynamical construction of random-cluster measures for arbitrary graphs, and for unimodular transitive graphs, lack of percolation for ...

متن کامل

Expansion And Isoperimetric Constants For Product Graphs

Vertex and edge isoperimetric constants of graphs are studied. Using a functional-analytic approach, the growth properties, under products, of these constants is analyzed.

متن کامل

Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs

We consider an edge-isoperimetric problem (EIP) on the cartesian powers of graphs. One of our objectives is to extend the list of graphs for whose cartesian powers the lexicographic order provides nested solutions for the EIP. We present several new classes of such graphs that include as special cases all presently known graphs with this property. Our new results are applied to derive best poss...

متن کامل

D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs

The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017